Chebyshev approximation

См. также в других словарях:

• Approximation theory — In mathematics, approximation theory is concerned with how functions can best be approximated with simpler functions, and with quantitatively characterizing the errors introduced thereby. Note that what is meant by best and simpler will depend on …   Wikipedia

• Chebyshev polynomials — Not to be confused with discrete Chebyshev polynomials. In mathematics the Chebyshev polynomials, named after Pafnuty Chebyshev,[1] are a sequence of orthogonal polynomials which are related to de Moivre s formula and which can be defined… …   Wikipedia

• Chebyshev, Pafnuty Lvovich — ▪ Russian mathematician born May 4 [May 16, New Style], 1821, Okatovo, Russia died November 26 [December 8], 1894, St. Petersburg  founder of the St. Petersburg mathematical school (sometimes called the Chebyshev school), who is remembered… …   Universalium

• Chebyshev nodes — In numerical analysis, Chebyshev nodes are the roots of the Chebyshev polynomial of the first kind. They are often used as nodes in polynomial interpolation because the resulting interpolation polynomial minimizes the Runge s phenomenon. Contents …   Wikipedia

• Chebyshev filter — Linear analog electronic filters Network synthesis filters Butterworth filter Chebyshev filter Elliptic (Cauer) filter Bessel filter Gaussian filter Optimum L (Legendre) filter Linkwitz Riley filter …   Wikipedia

• Chebyshev function — The Chebyshev function ψ(x), with x < 50 The function ψ( …   Wikipedia

• Théorie de l'approximation — En mathématiques, la théorie de l approximation concerne la façon dont les fonctions peuvent être approchées par de plus simples fonctions, en donnant une caractérisation quantitative des erreurs introduites par ces approximations. Un problème… …   Wikipédia en Français

• Theorie de l'approximation — Théorie de l approximation En mathématiques, la théorie de l approximation concerne la façon dont les fonctions peuvent être approchées par de plus simples fonctions, en donnant une caractérisation quantitative des erreurs introduites par ces… …   Wikipédia en Français

• Discrete Chebyshev polynomials — Not to be confused with Chebyshev polynomials. In mathematics, discrete Chebyshev polynomials, or Gram polynomials, are a type of discrete orthogonal polynomials used in approximation theory, introduced by Pafnuty Chebyshev (1864) and… …   Wikipedia

• Lanczos approximation — In mathematics, the Lanczos approximation is a method for computing the Gamma function numerically, published by Cornelius Lanczos in 1964. It is a practical alternative to the more popular Stirling s approximation for calculating the Gamma… …   Wikipedia

• Remez algorithm — The Remez algorithm (sometimes also called Remes algorithm, Remez/Remes exchange algorithm), published by Evgeny Yakovlevich Remez in 1934 [E. Ya. Remez, Sur la détermination des polynômes d approximation de degré donnée , Comm. Soc. Math.… …   Wikipedia